Parallel algorithms for certain matrix computations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Hybrid Monte Carlo Algorithms for Matrix Computations

In this paper we consider hybrid (fast stochastic approximation and deterministic refinement) algorithms for Matrix Inversion (MI) and Solving Systems of Linear Equations (SLAE). Monte Carlo methods are used for the stochastic approximation, since it is known that they are very efficient in finding a quick rough approximation of the element or a row of the inverse matrix or finding a component ...

متن کامل

Parallel Algorithms for Certain

The complexity of performing matrix computations, such as solving a linear system, inverting a nonsingular matrix or computing its rank, has received a lot of attention by both the theory and the scientiic computing communities. In this paper we address some \nonclassical" matrix problems that nd extensive applications, notably in control theory. More precisely, we study the matrix equations AX...

متن کامل

Parallel Matrix Computations

In this article we develop some algorithms and tools for solving matrix problems on parallel processing computers. Operations are synchronized through data-flow alone, which makes global synchronization unnecessary and enables the algorithms to be implemented on machines with very simple operating systems and communication protocols. As examples, zve present algorithms that form the main module...

متن کامل

I/O Efficient Algorithms for Matrix Computations

We analyse some QR decomposition algorithms, and show that the I/O complexity of the tile based algorithm is asymptotically the same as that of matrix multiplication. This algorithm, we show, performs the best when the tile size is chosen so that exactly one tile fits in the main memory. We propose a constant factor improvement, as well as a new recursive cache oblivious algorithm with the same...

متن کامل

Parallel Algorithms for Interval Computations: an Introduction

2 Why are Interval Computations Necessary? 2 2.1 A (brief) general overview of the problems that our world faces . . . . . . . . . . . . 2 2.2 Computational aspects of analysis, and where interval computation comes into the picture . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.3 Computational problems related to synthesis . . . . . . . . . . . . . ....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1997

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(97)83810-8